-- card: 5307 from stack: in
-- bmap block id: 0
-- flags: 0000
-- background id: 4289
-- name: 


-- part contents for background part 216
----- text -----
Read & Filed

-- part contents for background part 215
----- text -----
Article

-- part contents for background part 217
----- text -----
agrawal-jagadish88

-- part contents for background part 218
----- text -----
Rakesh Agrawal and H. V. Jagadish

-- part contents for background part 219
----- text -----
Partitioning Techniques for Large-Grained Parallelism

-- part contents for background part 220
----- text -----
IEEE Transactions on Computers

-- part contents for background part 222
----- text -----
December

-- part contents for background part 223
----- text -----
1988

-- part contents for background part 225
----- text -----
1627-1634

-- part contents for background part 231
----- text -----
37

-- part contents for background part 235
----- text -----
12

-- part contents for background part 237
----- text -----
How to optimally partition computations that that are homogeneous and separable one-level trees. Can determine optimal partition for given number of procs, and optimal number of procs. Applicable to networks of workstations. Good paper, and worth trying for simple example.

-- part contents for background part 238
----- text -----
loosely coupled multiprocessors, multicomputers, optimation, parallel processing, problem partitioning, processor sharing, workstation networks, bbl